Constraint logic programming for examination timetabling
نویسندگان
چکیده
منابع مشابه
Timetabling in Constraint Logic Programming
Generating timetables is a cumbersome and time consuming task, but programs developed to solve them are usually meant for a particular organisation and can not be easily adapted. Constraint Logic Programming, the result of generalizing Logic Programming uniication to constraint solving over a computation domain, aim at expressing constrained decision problems declaratively, and still solve them...
متن کاملUniversity Timetabling Using Constraint Logic Programming
A timetable is a temporal arrangement of a set of meetings such that all given constraints are satissed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of...
متن کاملCombined Automatic and Interactive Timetabling Using Constraint Logic Programming ?
We use Constraint Logic Programming and develop methods , techniques and concepts for a combined automatic and interactive timetabling of university courses and school curricula. An instance of such a timetabling system was developed for the Charit e Medical Faculty at the Humboldt University, Berlin. This paper looks at methods and techniques for solving this timetabling problem. An essential ...
متن کاملA Constraint Logic Programming Approach to Examination Scheduling
The scheduling of exams in institutions of higher education is a large, highly constrained and complex problem. The recent advent of modularity in many universities has resulted in an increase of the complexity of the problem, making the manual achievement of an acceptable solution a tedious and sometimes almost impossible problem. Examination scheduling is the process of assigning exams to tim...
متن کاملLogic and Constraint Logic Programming for Distributed Constraint Optimization
The field of Distributed Constraint Optimization Problems (DCOPs) has gained momentum, thanks to its suitability in capturing complex problems (e.g., multi-agent coordination and resource allocation problems) that are naturally distributed and cannot be realistically addressed in a centralized manner. The state of the art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1996
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00100-x